Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief
نویسندگان
چکیده
A simple Monte-Carlo algorithm can be used to calculate Dempster-Shafer belief very efficiently unless the conflict between the evidences is very high. This paper introduces and explores Markov Chain Monte-Carlo algorithms for calculating Dempster-Shafer belief that can also work well when the conflict is high.
منابع مشابه
A Monte-Carlo Algorithm for Dempster-Shafer Belief
A very computationally-efficient MonteCarlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster’s Rule of belief functions Bel1, . . . ,Belm then, for subset b of the frame Θ, Bel(b) can be calculated in time linear in |Θ| and m (given that the weight of conflict is bounded). The algorithm can also be used to improve the complexity of t...
متن کاملImportance Sampling Monte - Carlo Algorithms for the Calculation ofDempster - Shafer Belief
This paper presents importance sampling Monte-Carlo algorithms for the calculation of belief functions combination. When the connict between the evidence is not very high a simple Monte-Carlo algorithm can produce good quality estimations. For the case of highly connicting evidences a Markov chain Monte-Carlo algorithm was also proposed. In this paper, a new class of importance sampling based a...
متن کاملFast Markov Chain Algorithms for Calculating Dempster-Shafer Belief
We present a new type of Markov Chain algo rithm for the calculation of combined Dempster Shafer belief which is almost linear in the size of the frame thus making the calculation of belief feasible for a wider range of problems We also indicate how these algorithms may be used in the cal culation of belief in product spaces associated with networks
متن کاملA Sensor-Based Scheme for Activity Recognition in Smart Homes using Dempster-Shafer Theory of Evidence
This paper proposes a scheme for activity recognition in sensor based smart homes using Dempster-Shafer theory of evidence. In this work, opinion owners and their belief masses are constructed from sensors and employed in a single-layered inference architecture. The belief masses are calculated using beta probability distribution function. The frames of opinion owners are derived automatically ...
متن کاملZero-Sum Matrix Game with Payoffs of Dempster-Shafer Belief Structures and Its Applications on Sensors
The zero-sum matrix game is one of the most classic game models, and it is widely used in many scientific and engineering fields. In the real world, due to the complexity of the decision-making environment, sometimes the payoffs received by players may be inexact or uncertain, which requires that the model of matrix games has the ability to represent and deal with imprecise payoffs. To meet suc...
متن کامل